package offer;

public class offer_0010_1 {
    public int fib(int n) {
        if(n==1||n==2) return 1;
        long [] dp=new long[101];
        dp[1]=1;
        dp[2]=1;
        for(int i=3;i<=n;++i){
            dp[i]=dp[i-1]+dp[i-2];
        }
        return (int)dp[n]%1000000007;
    }

}
